Distributedly Testing Cycle-Freeness
نویسندگان
چکیده
We tackle local distributed testing of graph properties. This framework is well suited to contexts in which data dispersed among the nodes of a network can be collected by some central authority (like in, e.g., sensor networks). In local distributed testing, each node can provide the central authority with just a few information about what it perceives from its neighboring environment, and, based on the collected information, the central authority is aiming at deciding whether or not the network satisfies some property. We analyze in depth the prominent example of checking cycle-freeness, and establish tight bounds on the amount of information to be transferred by each node to the central authority for deciding cycle-freeness. In particular, we show that distributedly testing cycle-freeness requires at least dlog de−1 bits of information per node in graphs with maximum degree d, even for connected graphs. Our proof is based on a novel version of the seminal result by Naor and Stockmeyer (1995) enabling to reduce the study of certain kinds of algorithms to order-invariant algorithms, and on an appropriate use of the known fact that every free group can be linearly ordered.
منابع مشابه
Distributed Property Testing for Subgraph-Freeness Revisited
In the subgraph-freeness problem, we are given a constant-size graph H, and wish to determine whether the network contains H as a subgraph or not. The property-testing relaxation of the problem only requires us to distinguish graphs that are H-free from graphs that are -far from H-free, in the sense that an -fraction of their edges must be removed to obtain an H-free graph. Recently, Censor-Hil...
متن کاملWeak Forms of Monotonicity and Coordination-Freeness
Our earlier work [3] has shown that the classes of queries that can be distributedly computed in a coordination-free manner form a strict hierarchy depending on the assumptions of the model for distributed computations. In this paper, we further characterize these classes by revealing a tight relationship between them and certain weakened forms of monotonicity.
متن کاملTesting cycle-freeness: Finding a certificate
We deal with the problem of designing one-sided error property testers for cycle-freeness in bounded degree graphs. Such a property tester always accepts forests. Furthermore, when it rejects an input, it provides a short cycle as a certificate. The problem of testing cycle-freeness in this model was first considered by Goldreich and Ron [13]. They give a constant time tester with two-sided err...
متن کاملTesting odd-cycle-freeness in Boolean functions
Call a function f : F 2 → {0, 1} odd-cycle-free if there are no x1, . . . , xk ∈ Fn2 with k an odd integer such that f(x1) = · · · = f(xk) = 1 and x1 + · · · + xk = 0. We show that one can distinguish odd-cycle-free functions from those ǫ-far from being odd-cycle-free by making poly(1/ǫ) queries to an evaluation oracle. To obtain this result, we use connections between basic Fourier analysis an...
متن کاملDistributed Testing of Excluded Subgraphs
We study property testing in the context of distributed computing, under the classical CONGEST model. It is known that testing whether a graph is triangle-free can be done in a constant number of rounds, where the constant depends on how far the input graph is from being triangle-free. We show that, for every connected 4-node graph H , testing whether a graph is H-free can be done in a constant...
متن کامل